On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Explicit uniform bounds on integrals of Bessel functions and trace theorems for Fourier transforms

Explicit and partly sharp estimates are given of integrals over the square of Bessel functions with an integrable weight which can be singular at the origin. They are uniform with respect to the order of the Bessel functions and provide explicit bounds for some smoothing estimates as well as for the L² restrictions of Fourier transforms onto spheres in which are independent of the radius of the sphere. For more special weights these restrictions are shown to be Hölder continuous with a Hölder constant having this independence as well. To illustrate the use of these results a uniform resolvent estimate of the free Dirac operator with mass in dimensions is derived.     

The polynomial reconstruction problem: The first 50 years

The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations.     

LIOUVILLIAN AND ANALYTIC FIRST INTEGRALS FOR THE BRUSSELATOR SYSTEM

We characterize the Liouvillian and analytic first integrals for the polynomial differential systems of the form x′ = a - (b + 1)x + x²y, y′ = bx - x²y, with a, b ∈ ?, called the Brusselator differential systems.     

Hierarchical Model-Based Clustering for Large Datasets

In recent years, hierarchical model-based clustering has provided promising results in a variety of applications. However, its use with large datasets has been hindered by a time and memory complexity that are at least quadratic in the number of observations. To overcome this difficulty, this article proposes to start the hierarchical agglomeration from an efficient classification of the data in many classes rather than from the usual set of singleton clusters. This initial partition is derived from a subgraph of the minimum spanning tree associated with the data. To this end, we develop graphical tools that assess the presence of clusters in the data and uncover observations difficult to classify. We use this approach to analyze two large, real datasets: a multiband MRI image of the human brain and data on global precipitation climatology. We use the real datasets to discuss ways of integrating the spatial information in the clustering analysis. We focus on two-stage methods, in which a second stage of processing using established methods is applied to the output from the algorithm presented in this article, viewed as a first stage.     

优化端点条件的平面二次均匀B样条插值曲线

在利用反求法构造B样条插值曲线时，往往需要选取端点条件。 因此，可对端点条件进行优化选取，使得构造的B样条插值曲线满足特定要求。提出了一种利用曲线内能极小选取平面二次均匀B样条插值曲线端点条件的算法。首先给出了二次均匀B样条插值曲线分控制顶点与首个控制顶点（即端点条件）的递推关系式；然后给出了利用曲线内能极小优化选取首个控制顶点的算法，证明了利用该算法构造的C¹连续二次均匀B样条插值曲线为保形插值，并通过数值算例证明了算法的有效性；最后，为便于实际应用，基于MATLAB平台设计了算法所对应的图形用户界面，用户通过简单的操作即可获得光顺的C¹连续二次均匀B样条保形插值曲线。     

A mixed hp FEM for the approximation of fourth‐order singularly perturbed problems on smooth domains

We consider fourth‐order singularly perturbed problems posed on smooth domains and the approximation of their solution by a mixed Finite Element Method on the so‐called Spectral Boundary Layer Mesh. We show that the method converges uniformly, with respect to the singular perturbation parameter, at an exponential rate when the error is measured in the energy norm. Numerical examples illustrate our theoretical findings.     

Classical Backfitting for Smooth-Backfitting Additive Models

Smooth backfitting has been shown to have better theoretical properties than classical backfitting for fitting additive models based on local linear regression. In this article, we show that the smooth backfitting procedure in the local linear case can be alternatively performed as a classical backfitting procedure with a different type of smoother matrices. These smoother matrices are symmetric and shrinking and some established results in the literature are readily applicable. The connections allow the smooth backfitting algorithm to be implemented in a much simplified way, give new insights on the differences between the two approaches in the literature, and provide an extension to local polynomial regression. The connections also give rise to a new estimator at data points. Asymptotic properties of general local polynomial smooth backfitting estimates are investigated, allowing for different orders of local polynomials and different bandwidths. Cases of oracle efficiency are discussed. Computer-generated simulations are conducted to demonstrate finite sample behaviors of the methodology and a real data example is given for illustration. Supplementary materials for this article are available online.     

On the Differential Polynomial of a Graph

We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G.